Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
نویسندگان
چکیده
منابع مشابه
Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain graph. In this paper, we define the reliability as the existence probability of all minimum spanning trees and present an algorithm for evaluating reliability of the minimum spanning tree on uncertain graph. The time complexity of the algorithm is O(Nmn), where n...
متن کاملUncertain Distribution-Minimum Spanning Tree Problem
This paper investigates the minimum spanning tree problem in the framework of uncertainty theory, where the edge weights are assumed as uncertain variables. The concept of ideal uncertain minimum spanning tree is initiated by extending the definition of the uncertain α-minimum spanning tree. On the basis of this new concept, we propose the definition of uncertain distribution-minimum spanning t...
متن کاملMinimum Spanning Tree with Uncertain Random Weights
This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distr...
متن کاملUncertain Quadratic Minimum Spanning Tree Problem
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance co...
متن کاملThe Minimum Spanning Tree Problem on a Planar Graph
Finding a spanning tree of minimum weight is one of the best known graph problems. a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Dierent from Cheriton and Tarjan's algorithm, our algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computers
سال: 2015
ISSN: 1796-203X
DOI: 10.17706/jcp.10.1.45-56